package com.elloe.实现二叉树的Node节点.递归后序遍历;

import com.elloe.实现二叉树的Node节点.Node的Java实现.Node;

/**
 * @author ElloeStudy(Sifa Zhang)
 * @create 2022-04-09 13:56
 * To: 真常应物，真常得性，常清常静，常清静矣
 */
public class TraversalAfter {
    public void afterTraversal(Node node){
        if (node == null){
            return;
        }
        afterTraversal(node.getLeft());
        afterTraversal(node.getRight());
        System.out.print(node.getValue() + " ");
    }
}
